Modified Realizability Toposes and Strong Normalization Proofs

نویسندگان

  • Martin Hyland
  • C.-H. Luke Ong
چکیده

This paper is motivated by the discovery that an appropriate quotient SN 3 of the strongly normalising untyped 3-terms (where 3 is just a formal constant) forms a partial applicative structure with the inherent application operation. The quotient structure satises all but one of the axioms of a partial combinatory algebra (pca). We call such partial applicative structures conditionally partial combinatory algebras (c-pca). Remarkably, an arbitrary right-absorptive c-pca gives rise to a tripos provided the underlying intuitionistic predicate logic is given an interpretation in the style of Kreisel's modied realizability, as opposed to the standard Kleene-style realizability. Starting from an arbitrary right-absorptive c-pca U , the tripos-to-topos construction due to Hyland et al. can then be carried out to build a modied realizability topos TOP m (U) of non-standard sets equipped with an equality predicate. Church's Thesis is internally valid in TOP m (K 1) (where the pca K 1 is \Kleene's rst model" of natural numbers) but not Markov's Principle. There is a topos inclusion of SET | the \classical" topos of sets | into TOP m (U); the image of the inclusion is just sheaves for the ::-topology. Separated objects of the ::-topology are characterized. We identify the appropriate notion of pers (partial equivalence relations) in the modied realizability setting and state its completeness properties. The topos TOP m (U) has enough completeness property to provide a category-theoretic semantics for a family of higher type theories which include Girard's System F and the Calculus of Constructions due to Coquand and Huet. As an important application, by interpreting type theories in the topos TOP m (SN 3), a clean semantic explanation of the Tait-Girard style strong normalization argument is obtained. We illustrate how a strong normalization proof for an impredicative and dependent type theory may be assembled from two general \stripping argu-ments" in the framework of the topos TOP m (SN 3). This opens up the possibility of a \generic" strong normalization argument for an interesting class of type theories.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Mints' Reduction for ccc-Calculus

A formalization of the strong normalization proof for system F in LEGO p. 13 Partial intersection type assignment in applicative term rewriting systems p. 29 Extracting constructive content from classical logic via control-like reductions p. 45 Combining first and higher order rewrite systems with type assignment systems p. 60 A term calculus for intuitionistic linear logic p. 75 Program extrac...

متن کامل

The Gleason Cover of a Realizability Topos

Recently Benno van den Berg [1] introduced a new class of realizability toposes which he christened Herbrand toposes. These toposes have strikingly different properties from ordinary realizability toposes, notably the (related) properties that the ‘constant object’ functor from the topos of sets preserves finite coproducts, and that De Morgan’s law is satisfied. In this paper we show that these...

متن کامل

Program Extraction From Proofs of Weak Head Normalization

We formalize two proofs of weak head normalization for the simply typed lambdacalculus in first-order minimal logic: one for normal-order reduction, and one for applicative-order reduction in the object language. Subsequently we use Kreisel’s modified realizability to extract evaluation algorithms from the proofs, following Berger; the proofs are based on Tait-style reducibility predicates, and...

متن کامل

Sheaf toposes for realizability

We compare realizability models over partial combinatory algebras by embedding them into sheaf toposes. We then use the machinery of Grothendieck toposes and geometric morphisms to study the relationship between realizability models over different partial combinatory algebras. This research is part of the Logic of Types and Computation project at Carnegie Mellon University under the direction o...

متن کامل

Geometric Morphisms of Realizability Toposes

We show that every geometric morphism between realizability toposes satisfies the condition that its inverse image commutes with the ‘constant object’ functors, which was assumed by John Longley in his pioneering study of such morphisms. We also provide the answer to something which was stated as an open problem on Jaap van Oosten’s book on realizability toposes: if a subtopos of a realizabilit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993